#include <iostream>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <set>
#include <vector>
#include <cstdio>
#include <cmath>
#define LL long long
#define nextLine() {int c = 0; while ((c = getchar()) != EOF && c != 10);}
#define sqr(a) ((a) * (a))
#define fill(a, c) memset(a, c, sizeof a)
#define ldb long double
#define sgn(a) ((a) > eps ? 1 : -1)
const ldb eps = 1e-9;
const ldb pi = fabs(atan2(0.0, -1.0));
const int INF = 1 << 28;
const LL LINF = 1ll << 50;
const ldb LDINF = 1e70;
const ldb cos3 = cos(pi / 3);
const ldb sin3 = sin(pi / 3);
using namespace std;


LL f[100][100];
const LL MOD = 1000000007;
int n;

void Load()
{   	
	cin >> n;
}

LL extGcd(LL a, LL b, LL &x, LL &y)
{
	if (b == 0ll)
	{
		x = 1;
		y = 0;
		return a;
	}
	else
	{
		LL x1, y1;
		LL d = extGcd(b, a % b, x1, y1);
		x = y1;
		y = x1 - (a / b) * y1;
		return d;
	}
}

LL Inv(LL a)
{
	LL x1, y1;
	extGcd(a, MOD, x1, y1);
	x1 %= MOD;
	x1 += MOD;
	x1 %= MOD;
	return x1;
}

LL C(LL n, LL m)
{
	LL res = 1;
	int i;
	for (i = n - m + 1; i <= n; i++)
	{
		res *= i;
		res %= MOD;
	}
	for (i = 2; i <= m; i++)
	{
		if ((Inv(i) * i) % MOD != 1) cerr << "BOTVA";
		res *= Inv(i);
		res %= MOD;
	}
	return res;
}

void Solve()
{
	int i, j, k;
	f[0][1] = 1;
/*	for (int i = 1; i <= 2 * n; i++)
	{
		for (j = 1; j <= 2 * n; j++)
		{
			for (k = 1; k <= j; k++)
				f[i][j] = (f[i][j] + f[i - 1][k]) % MOD;
				cout << f[i][j] << " ";
		}
		cout << "\n";
	}
	*/
	LL res = C(n * 2 + 1 - 2, n);
	res *= 2;
	res %= MOD;
	res -= n;
	res += MOD;
	res %= MOD;
	cout << res;
}

int main()
{
	#ifndef ONLINE_JUDGE
	freopen("in", "rt", stdin);
	freopen("out", "wt", stdout);
	#endif
	Load();
	Solve();
	return 0;
}